Estimating short-time period to break different types of chaotic modulation based secure communications

摘要

In recent years, chaotic attractors have been extensively used in the designof secure communication systems. One of the preferred ways of transmitting theinformation signal is binary chaotic modulation, in which a binary messagemodulates a parameter of the chaotic generator. This paper presents a method ofattack based on estimating the short-time period of the ciphertext generatedfrom the modulated chaotic attractor. By calculating and then filtering theshort-time period of the transmitted signal it is possible to obtain the binaryinformation signal with great accuracy without any knowledge of the parametersof the underlying chaotic system. This method is successfully applied tovarious secure communication systems proposed in the literature based ondifferent chaotic attractors.